Fast minimal triangulation algorithm using minimum degree criterion
نویسندگان
چکیده
منابع مشابه
Fast minimal triangulation algorithm using minimum degree criterion
We propose an algorithm for minimal triangulation which, using simple and efficient strategy, subdivides the input graph in different, almost non-overlapping, subgraphs. Using the technique of matrix multiplication for saturating the minimal separators, we show that the partition of the graph can be computed in time O(n) where n is the time required by the binary matrix multiplication. After sa...
متن کاملThe Minimum Degree Heuristic and the Minimal Triangulation Process
The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a minimum triangulation of a graph. It is widely used as a component in every sparse matrix package, and it is known to produce triangulations with few ll edges in practice, although no theoretical bound or guarantee has been shown concerning the amount of ll it introduces. ...
متن کاملMinimum degree triangulation for rectangular domains
This paper describes an optimal triangulation algorithm for rectangles. We derive lower bounds on the maximum degree of triangulation, and show that our triangulation algorithm matches the lower bounds. Several important observations are also made, including a zig-zag condition that can verify whether a triangulation can minimizes the maximum degree to 4 or not. In addition, this paper identifi...
متن کاملcient Implementation of a Minimal Triangulation Algorithm
LB-triang, an algorithm for computing minimal triangulations of graphs, was presented by Berry in 1999 [1], and it gave a new characterization of minimal triangulations. The time complexity was conjectured to be O(nm), but this has remained unproven until our result. In this paper we present and prove an O(nm) time implementation of LB-triang, and we call the resulting algorithm LB-treedec. The...
متن کاملThe minimum degree of Ramsey-minimal graphs
We write H → G if every 2-coloring of the edges of graph H contains a monochromatic copy of graph G. A graph H is G-minimal if H → G, but for every proper subgraph H ′ of H, H ′ 6→ G. We define s(G) to be the minimum s such that there exists a G-minimal graph with a vertex of degree s. We prove that s(Kk) = (k − 1) and s(Ka,b) = 2 min(a, b) − 1. We also pose several related open problems. c © 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.04.022